Multi-query optimization for on-line analytical processing
نویسندگان
چکیده
Multi-dimensional expressions (MDX) provide an interface for asking several related OLAP queries simultaneously. An interesting problem is how to optimize the execution of an MDX query, given that most data warehouses maintain a set of redundant materialized views to accelerate OLAP operations. A number of greedy and approximation algorithms have been proposed for different versions of the problem. In this paper we evaluate experimentally their performance, concluding that they do not scale well for realistic workloads. Motivated by this fact, we develop two novel greedy algorithms. Our algorithms construct the execution plan in a top–down manner by identifying in each step the most beneficial view, instead of finding the most promising query. We show by extensive experimentation that our methods outperform the existing ones in most cases. r 2003 Elsevier Science Ltd. All rights reserved.
منابع مشابه
Multi-Dimensional Analysis of Data Streams Using Stream Cubes
Large volumes of dynamic stream data pose great challenges to its analysis. Besides its dynamic and transient behavior, stream data has another important characteristic: multi-dimensionality. Much of stream data resides at a multidimensional space and at rather low level of abstraction, whereas most analysts are interested in relatively high-level dynamic changes in some combination of dimensio...
متن کاملParallel data cube construction for high performance on-line analytical processing
Decision support systems use On-Line Analytical Processing (OLAP) to analyze data by posing complex queries that require diierent views of data. Traditionally , a relational approach (ROLAP) has been taken to build such systems. More recently, multi-dimensional database techniques (MOLAP) have been applied to decision-support applications. Data is stored in multi-dimensional arrays which is a n...
متن کاملAlgorithms for data warehouse design to enhance decision-making
On-line analytical processing (OLAP) queries are strongly affected by the amount data needed to be accessed from the disk. Therefore, there is a need to employ techniques that can facilitate efficient execution of these queries. There has been a lot of work to optimize the performance of relational data warehouses. Among the two fragmentation techniques, vertical fragmentation is often consider...
متن کاملResearch on Big Data Query Online Analysis and Processing Technology on the Basis of Decision Tree Model
In this paper, we prompt a new big data query online analysis and processing method based on decision tree model. The purpose of this dissertation is to realize the high-efficiency of multi-dimensional OLAP query by studying the key approaches for improving the OLAP query efficiency. In order to bring the full play of data analysis, the concept of on-line analytical mining (OLAM) is used for re...
متن کاملRelational Databases Query Optimization using Hybrid Evolutionary Algorithm
Optimizing the database queries is one of hard research problems. Exhaustive search techniques like dynamic programming is suitable for queries with a few relations, but by increasing the number of relations in query, much use of memory and processing is needed, and the use of these methods is not suitable, so we have to use random and evolutionary methods. The use of evolutionary methods, beca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Syst.
دوره 28 شماره
صفحات -
تاریخ انتشار 2003